The Minimum Exponent of the Primitive Digraphs on the given Number of Arcs
نویسنده
چکیده
Primitive digraphs on n vertices, k arcs and girth s are considered. By a(n, k, s) we mean the minimum exponent taken over all such digraphs. We estimate the number a(n, k, s) using the Frobenius number for special values of k and s.
منابع مشابه
Primitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs
Article history: Received 3 June 2010 Accepted 2 November 2010 Available online 26 November 2010 Submitted by R.A. Brualdi AMS classification: 05C50 15A09 15A48
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملGeneralized Exponents of Primitive Symmetric Digraphs
A strongly connected digraph D of order n is primitive (aperiodic) provided the greatest common divisor of its directed cycle lengths equals 1. For such a digraph there is a minimum integer t, called the exponent of D, such that given any ordered pair of vertices x and y there is a directed walk from x to y of length t. The exponent of D is the largest of n ‘generalized exponents’ that may be a...
متن کاملExponents of primitive graphs
Suppose G is a primitive graph with n > 1 vertices. Let L(u) be the length of a shortest closed walk of odd length containing vertex u ∈ V (G), and let M = max{L(u) | u ∈ V (G)}. We prove that the exponent of G is equal to M − 1 if M ≥ n − g + 1 and less than or equal to n − g if M ≤ n − g + 1, where g is the length of a shortest cycle in G of odd length. We then determine the exponent set of p...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کامل